Secure Analysis for Interval-based Algorithms

we consider several distributed collaborative key agreement and authentication protocols for dynamic peer groups. There are several important characteristics which make this problem different from traditional secure group communication. They are: 1) distributed nature in which there is no centralized key server; 2) collaborative nature in which the group key is contributory (i.e., each group member will collaboratively contribute its part to the global group key); and 3) dynamic nature in which existing members may leave the group while new members may join. Instead of performing individual rekeying operations, i.e., recomputing the group key after every join or leave request, we are going to re key for a batch of join and leave operations. The objectives of the project are to generate a group key.With the help of the group key sharing the resources like accessing the files and implement the Queue-batch algorithm, which performs the best among the three interval-based algorithms by comparing them. More importantly, to show that Queuebatch algorithm can substantially reduce the computation and communication workload in a highly dynamic environment